Infinite graphs that do not contain cycles of length four

摘要

We construct a countable infinite graph G that does not contain cycles oflength four having the property that the sequence of graphs $G_n$ induced bythe first $n$ vertices has minimum degree $\delta(G_n)> n^{\sqrt{2}-1+o(1)}$.